Partitioning uncertain workloads

Partitioning Uncertain Workflows

It is common practice to partition complex workflows into separate channels in order to speed up their completion times. When this is done within a distributed environment, unavoidable fluctuations make individual realizations depart from the expected average gains. We present a method for breaking any complex workflow into several workloads in such a way that once their outputs are joined, the...

Energy-Efficient Scheduling for Tasks with Uncertain Workloads

Insert - aware Partitioning and Indexing Techniques For Skewed Database Workloads

Many data-intensive websites are characterized by a dataset that grows much faster than the rate that users access the data and possibly high insertion rates. In such systems, the growing size of the dataset leads to a larger overhead for maintaining and accessing indexes even while the query workload becomes increasingly skewed. Additionally, the database index update costs can be a non-trivia...

Graph Partitioning Algorithms for Distributing Workloads of Parallel Computations

This paper surveys graph partitioning algorithms used for parallel computing, with an emphasis on the problem of distributing workloads for parallel computations. Geometric, structural, and refinementbased algorithms are described and contrasted. In addition, multilevel partitioning techniques and issues related to parallel partitioning are addressed. All algorithms are evaluated qualitatively ...

Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves

We discuss Inverse Spaceelling Partitioning (ISP), a partitioning strategy for non-uniform scientiic computations running on distributed memory MIMD parallel computers. We consider the case of a dynamic workload distributed on a uniform mesh, and compare ISP against Orthogonal Recursive Bisection (ORB) and a Median of Medians variant of ORB, ORB-MM. We present two results. First, ISP and ORB-MM...